package com.mianshi;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

//勾股数元祖
public class rongyao {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        for(int i = n; i <= m-1; i++){
            for(int j = i+1; j <= m; j++){
                double k = Math.sqrt(Math.pow(i,2)+Math.pow(j,2));
                long kz = (long) k;
                if(k - kz == 0 && k <= m && isZhiShu(i,j) && isZhiShu(i,(int) k) && isZhiShu(j,(int) k)){
                    System.out.println(i+" "+j+" "+(int)k);
                } else if(k > m){
                    break;
                }

            }
        }
    }

    //判断a,b互质
    public static boolean isZhiShu(int a, int b){
        if(a < b){
            int temp = a;
            a = b;
            b = temp;
        }
        int c;
        while((c = a % b) != 0){
            a = b;
            b = c;
        }
        return b == 1;
    }
}
